Additive Approximation for Bounded Degree Survivable Network Design
نویسندگان
چکیده
منابع مشابه
Improved Algorithm for Degree Bounded Survivable Network Design Problem
We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...
متن کاملA Unified Algorithm for Degree Bounded Survivable Network Design
We present an approximation algorithm for the minimum bounded degree Steiner network problem that returns a Steiner network of cost at most two times the optimal and the degree on each vertex v is at most min{bv + 3rmax, 2bv + 2}, where rmax is the maximum connectivity requirement and bv is the given degree bound on v. This unifies, simplifies, and improves the previous results for this problem.
متن کاملSurvivable Network Design with Degree or Order
We present algorithmic and hardness results for network design problems with degree or order constraints. The first problem we consider is the Survivable Network Design problem with degree constraints on vertices. The objective is to find a minimum cost subgraph which satisfies connectivity requirements between vertices and also degree upper bounds Bv on the vertices. This includes the well-stu...
متن کاملAn efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-t ime approximation algorithm was given by Williamson et al. (Combinatorica 15 (1995) 435454) . This paper gives an improved version that is more efficient. Consider a graph of n vertices and connectivity requirements that are at most...
متن کاملFast Approximation Algorithms for the Generalized Survivable Network Design Problem
In a standard f -connectivity network design problem, we are given an undirected graph G = (V,E), a cut-requirement function f : 2 → N, and non-negative costs c(e) for all e ∈ E. We are then asked to find a minimum-cost vector x ∈ N such that x(δ(S)) ≥ f(S) for all S ⊆ V . We focus on the class of such problems where f is a proper function. This encodes many well-studied NP-hard problems such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2013
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110854461